目的：（1）开发深度学习算法，以识别3D光学相干断层扫描（OCT）扫描中的视神经头（ONH）的主要组织结构; （2）利用这些信息在健康，光盘博森（奇数）和乳头膜ONHS之间鲁棒地区分。由于高颅内压（51只眼）和健康对照（100只眼睛），这是一种横截面对比研究，由于高颅内压（51只眼睛），以及健康的对照（100只眼）。使用OCT获得ONH的3D扫描，然后加工以改善深层组织可见性。首先，使用984 B-Scans（从130只眼睛）开发了深度学习算法，以识别：主要的神经/结缔组织和奇数区域。使用骰子系数（DC）评估我们的算法的性能。在第2步骤中，使用1500Ct卷设计了一个分类算法（随机林），以严格从其德鲁森和普拉拉马那肿胀得分（来自细分）来执行3级分类（1：奇数，2：Papilledema，3：健康） ）。为了评估性能，我们报告了每个类的接收器操作特征曲线（AUC）下的区域。我们的分割算法能够在存在时隔离神经和结缔组织和奇数区域。这是在测试集上的平均DC为0.93 $ 0.03的平均直流，相应于良好性能。分类是用高AUC的分类，即检测奇数，0.99美元0.01 0.01美元，用于检测Papilledema的0.99美元，0.98美元$ 0.02用于检测健康的ONH。我们的AI方法可以使用单个OCT扫描来准确地歧视奇数乳头。我们的分类表现非常出色，有需要在更大的人口中验证。我们的方法可能有可能建立10月作为神经眼科诊断成像的主干。

目的：评估中央视网膜血管躯干及其分支（CRVT＆B）的三维（3D）结构构型是否可用作青光眼的诊断标志物。方法：我们训练了深度学习网络，从光神经头（ONH）的光学相干断层扫描（OCT）体积的B-Scans自动分割CRVT＆B。随后，使用从OCT体积中提取的CRVT＆B的结构构型，两种不同的方法用于青光眼诊断。在第一种方法中，我们旨在仅使用CNN的3D CNN和CRVT＆B的3D结构提供诊断。对于第二种方法，我们将CRVT＆B的3D结构投射到三个平面上以获得2D图像，然后使用2D CNN进行诊断。使用骰子系数评估分割精度，而使用接收器操作特性曲线（AUC）下的区域评估诊断准确度。 CRVT＆B的诊断性能也与视网膜神经纤维层（RNFL）厚度进行了比较。结果：我们的分割网络能够从OCT扫描有效地分段视网膜血管。在测试集上，我们实现了0.81 \ PM0.07的骰子系数。 3D和2D诊断网络能够将青光眼与非青光眼受试者区分别分别区分82.7％和83.3％的精度。 CRVT＆B的相应AUC为0.89和0.90，高于用RNFL厚度获得的0.90℃。结论：我们的工作表明，CRVT＆B的诊断功能优于金标 - 标准的青光眼参数，即RNFL厚度。我们的作品还建议主要视网膜血管形成骨架 - 其配置可以代表主要的ONH结构变化，通常观察到青光眼的开发和进展。

神经网络和相关的深度学习方法目前处于用于分类对象的技术的前沿。但是，他们通常需要大量的时间和模型培训数据。他们学到的模型有时很难解释。在本文中，我们推进了FastMAPSVM（用于对复杂对象进行分类的可解释的机器学习框架），这是用于通用分类任务的神经网络的有利替代方法。 FastMAPSVM通过组合FastMap和SVM的互补强度，将支持矢量机（SVM）（SVM）的适用性扩展到具有复杂对象的域。 FastMap是一种有效的线性时间算法，该算法将复杂的对象映射到欧几里得空间中的指向，同时保留它们之间的成对域特异性距离。我们证明了FastMAPSVM在分类地震图的背景下的效率和有效性。我们表明，就精确，回忆和准确性而言，其性能与其他最先进的方法相当。但是，与其他方法相比，FastMAPSVM对模型培训的时间和数据量明显较小。它还提供了对象及其之间的分类边界的明显可视化。我们希望FastMAPSVM可行对于许多其他实际域中的分类任务。

Python已成为机器学习（ML），深度学习（DL）和数据科学（DS）等新兴领域的主要编程语言。 Python的一个有吸引力的功能是，它提供易于使用的编程界面，同时允许图书馆开发人员通过利用高性能计算（HPC）平台提供的计算能力来提高其应用程序的性能。有效的通信是在并行系统上扩展应用程序的关键，通常通过HPC硬件上的消息传递接口（MPI）标准库（MPI）标准库来启用该应用程序。 MPI4PY是一个基于Python的通信库，为Python应用程序提供了类似MPI的接口，允许应用程序开发人员利用包括GPU在内的并行处理元素。但是，目前尚无基准套件来评估现代HPC系统上MPI4PY和PYTHON MPI代码的通信性能。为了弥合这一差距，我们提出了OMB-PY-开源OSU微基准（OMB）套件的Python扩展 - 旨在评估Python中基于MPI的并行应用的通信性能。据我们所知，OMB-PY是平行Python应用程序的第一间通信基准套件。 OMB-PY由各种点对点和集体通信基准测试组成，这些测试适用于一系列流行的Python库，包括Numpy，Cupy，Numba和Pycuda。我们的评估表明，与天然MPI库相比，MPI4PY引入了一个小开销。我们计划公开发布OMB-PY，以使Python HPC社区受益。

Designing experiments often requires balancing between learning about the true treatment effects and earning from allocating more samples to the superior treatment. While optimal algorithms for the Multi-Armed Bandit Problem (MABP) provide allocation policies that optimally balance learning and earning, they tend to be computationally expensive. The Gittins Index (GI) is a solution to the MABP that can simultaneously attain optimality and computationally efficiency goals, and it has been recently used in experiments with Bernoulli and Gaussian rewards. For the first time, we present a modification of the GI rule that can be used in experiments with exponentially-distributed rewards. We report its performance in simulated 2- armed and 3-armed experiments. Compared to traditional non-adaptive designs, our novel GI modified design shows operating characteristics comparable in learning (e.g. statistical power) but substantially better in earning (e.g. direct benefits). This illustrates the potential that designs using a GI approach to allocate participants have to improve participant benefits, increase efficiencies, and reduce experimental costs in adaptive multi-armed experiments with exponential rewards.

Modelling and forecasting real-life human behaviour using online social media is an active endeavour of interest in politics, government, academia, and industry. Since its creation in 2006, Twitter has been proposed as a potential laboratory that could be used to gauge and predict social behaviour. During the last decade, the user base of Twitter has been growing and becoming more representative of the general population. Here we analyse this user base in the context of the 2021 Mexican Legislative Election. To do so, we use a dataset of 15 million election-related tweets in the six months preceding election day. We explore different election models that assign political preference to either the ruling parties or the opposition. We find that models using data with geographical attributes determine the results of the election with better precision and accuracy than conventional polling methods. These results demonstrate that analysis of public online data can outperform conventional polling methods, and that political analysis and general forecasting would likely benefit from incorporating such data in the immediate future. Moreover, the same Twitter dataset with geographical attributes is positively correlated with results from official census data on population and internet usage in Mexico. These findings suggest that we have reached a period in time when online activity, appropriately curated, can provide an accurate representation of offline behaviour.

Machine Translation (MT) system generally aims at automatic representation of source language into target language retaining the originality of context using various Natural Language Processing (NLP) techniques. Among various NLP methods, Statistical Machine Translation(SMT). SMT uses probabilistic and statistical techniques to analyze information and conversion. This paper canvasses about the development of bilingual SMT models for translating English to fifteen low-resource Indian Languages (ILs) and vice versa. At the outset, all 15 languages are briefed with a short description related to our experimental need. Further, a detailed analysis of Samanantar and OPUS dataset for model building, along with standard benchmark dataset (Flores-200) for fine-tuning and testing, is done as a part of our experiment. Different preprocessing approaches are proposed in this paper to handle the noise of the dataset. To create the system, MOSES open-source SMT toolkit is explored. Distance reordering is utilized with the aim to understand the rules of grammar and context-dependent adjustments through a phrase reordering categorization framework. In our experiment, the quality of the translation is evaluated using standard metrics such as BLEU, METEOR, and RIBES

Existing federated classification algorithms typically assume the local annotations at every client cover the same set of classes. In this paper, we aim to lift such an assumption and focus on a more general yet practical non-IID setting where every client can work on non-identical and even disjoint sets of classes (i.e., client-exclusive classes), and the clients have a common goal which is to build a global classification model to identify the union of these classes. Such heterogeneity in client class sets poses a new challenge: how to ensure different clients are operating in the same latent space so as to avoid the drift after aggregation? We observe that the classes can be described in natural languages (i.e., class names) and these names are typically safe to share with all parties. Thus, we formulate the classification problem as a matching process between data representations and class representations and break the classification model into a data encoder and a label encoder. We leverage the natural-language class names as the common ground to anchor the class representations in the label encoder. In each iteration, the label encoder updates the class representations and regulates the data representations through matching. We further use the updated class representations at each round to annotate data samples for locally-unaware classes according to similarity and distill knowledge to local models. Extensive experiments on four real-world datasets show that the proposed method can outperform various classical and state-of-the-art federated learning methods designed for learning with non-IID data.

This is paper for the smooth function approximation by neural networks (NN). Mathematical or physical functions can be replaced by NN models through regression. In this study, we get NNs that generate highly accurate and highly smooth function, which only comprised of a few weight parameters, through discussing a few topics about regression. First, we reinterpret inside of NNs for regression; consequently, we propose a new activation function--integrated sigmoid linear unit (ISLU). Then special charateristics of metadata for regression, which is different from other data like image or sound, is discussed for improving the performance of neural networks. Finally, the one of a simple hierarchical NN that generate models substituting mathematical function is presented, and the new batch concept ``meta-batch" which improves the performance of NN several times more is introduced. The new activation function, meta-batch method, features of numerical data, meta-augmentation with metaparameters, and a structure of NN generating a compact multi-layer perceptron(MLP) are essential in this study.

The existing methods for video anomaly detection mostly utilize videos containing identifiable facial and appearance-based features. The use of videos with identifiable faces raises privacy concerns, especially when used in a hospital or community-based setting. Appearance-based features can also be sensitive to pixel-based noise, straining the anomaly detection methods to model the changes in the background and making it difficult to focus on the actions of humans in the foreground. Structural information in the form of skeletons describing the human motion in the videos is privacy-protecting and can overcome some of the problems posed by appearance-based features. In this paper, we present a survey of privacy-protecting deep learning anomaly detection methods using skeletons extracted from videos. We present a novel taxonomy of algorithms based on the various learning approaches. We conclude that skeleton-based approaches for anomaly detection can be a plausible privacy-protecting alternative for video anomaly detection. Lastly, we identify major open research questions and provide guidelines to address them.